Simple Graphs for Complex Prediction Functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complex Embeddings for Simple Link Prediction

In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and anti...

متن کامل

SimplE Embedding for Link Prediction in Knowledge Graphs

The aim of knowledge graphs is to gather knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs are far from complete. To address the incompleteness of the knowledge graphs, link prediction approaches have been developed which make probabilistic predictions about new links in a knowledge graph given the existing links. Tensor factorization ...

متن کامل

The origin recognition complex: from simple origins to complex functions.

Eukaryotic DNA replication is an intricate process that requires the coordinate and tightly regulated action of numerous molecular machines. Eukaryotic cells must choose hundreds if not thousands of origins of replication and assemble multiple proteins or protein complexes at these sites. During S phase, these complexes are activated in a reproducible, temporal program to generate twice this nu...

متن کامل

Holant Problems for Regular Graphs with Complex Edge Functions

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which allow us to prove that a pair of combinatorial gadgets in combination succeed in proving #P-hardness; and (3) algebraic symmetrization, which si...

متن کامل

Optimizing Complex Loss Functions in Structured Prediction

In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and false negative counts. The approach can be directly applied to performance measures such as Fβ score (natural language processing), intersection over union (image segmentation), Precision/Recall at k (search engines) and ROC area (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications for Statistical Applications and Methods

سال: 2008

ISSN: 2287-7843

DOI: 10.5351/ckss.2008.15.3.343